搜索资源列表
knignt
- 求解骑士游历问题的程序。骑士游历问题是在8X8格的国际象棋棋盘上随意放置一个马，按照马走“日”字的规则对马进行操作，问是否能够不重复的走遍棋盘的每个格。-Cavaliers traveled problem solving process. Cleveland traveled problem is the 8x8 grid of international chess pieces on dumped a horse, according to Ma take "days"
xiyangqishi
- 有多种方法喔!西洋棋中骑士的走法与象棋的马类似,只能横向二格,纵向一格或者横向一格,纵向两格(但是西洋棋棋子必须放在格子中),第1步有2种走法,第二步就有5种走法.今有5*5的棋盘,并将骑士的第一步放于左上角(0,0)的位置,试找出一个路径,使骑士在25步内把剩下的24个位置全部走完.输出结果时,将骑士的路径显示于的5*5的方格中,每一方格内显示出走到此方格内为第同步的数字. -are many ways! Chinese chess knight of the law and take a h
knight
- 骑士遍历问题，在一个n*n个方格的国际象棋棋盘上，马（骑士）从任意指定方格出发，按照横1 步竖2 步，或横2 步竖1步的跳马规则，走遍棋盘的每一个格子，且每个格子只走1次。-Knight, in an n * n box at the international chess board, Ma (Knight) from the arbitrary designation box and, in accordance with a further horizontal two-step vert
maxy
- a game simulate the horse chess (about artificial intelligence)
horse_by
- 马踏棋盘问题：国际象棋中的马，怎样才能不重复的跳遍棋盘上的每一格呢？ 笔者见过许多解决这类问题的程序，这个是最简洁同时也是速度最快的一个。-horse riding chessboard : the international chess Ma, how can we not repeat the jump all over the chessboard of each? I met many issues to resolve such procedures, this is the most
horse
- 将马随机放在国际象棋的8* 8 棋盘Bord[8Ⅱ8]的某个方格中，马按走棋规则进行移动。要求每个方格上只进入一次，走遍棋盘上全部64个方格。 -Grid of the horse were randomly placed in the 8* 8 chess board Bord [8 Ⅱ 8] of a horse by playing chess rules to move it. Requirements on each square only enter once traveled
Horse-Stepping
- 马踏棋盘程序，在8*8的格子中，马（按中国象棋的走法）不重复的将64个点走遍！-Horse Stepping on board procedures, 8* 8 grid, Ma (Chinese chess moves) repeat 64 points all over!
knight
- 在西洋棋中的武士（knight）与象棋中的马相似，走的是L型路线，输入一个表示期盼的大小值n，在输入一个起点坐标，找出一条从那一个起点，可以让武士棋走完n*n格而不重复的路径。-Chess samurai (knight) is similar to chess horse, taking the L-shaped route, enter a look forward to the size of the value of n, enter a starting point coordin
chess
- 本程序为delphi下实现n*n的跳马程序。程序里面还实现了动画操作等。为一个高分程序。-The procedures for the Delphi realize n* n the vaulting horse program. Program inside still realize the animation operation, etc. As a high score program.
The-horse-step-board
- 马踏棋盘、在文件中分别可选择国际象棋和中国象棋~！-The horse step board、In the file are can choose chess and Chinese chess
main
- 根据象棋中马走日规则，规定骑士走的路径，打印骑士走的步数-According to the chess horse day rules require Knight walking the path, print the number of steps to go by the Knight
Vault
- 跳马问题 有一m*n的棋盘（即棋盘由m行和n列），一马放在棋盘中任意位置，马按中国象棋跳法，从初始位置起跳，跳至边界后返回，求所有能返回初始位置的周游路线。-Vault with an m* n chessboard (ie board consisting of m rows and n columns), a horse anywhere on the board, according to Chinese chess horse jump method, from the initia
the-horse-working-in-the-chass
- 实现马踏棋盘的功能。 输入：马的初始位置。 输出：马踏棋盘的路径。利用贪心算法+回朔算法实现！可以产生全部可能的路径！而且可以可视化的输出动态行走路径！-implementation of the horse working in the chess.
Chess-Board-of-traverse
- 国际象棋棋盘上实现马的遍历（原创），遍历过程有图片显示和路径显示两种方式-Horse on chess board to achieve the ergodic (original), traversal path display a picture display and two ways
CHESS
- The horse moves on a chessboard so that the whole house of sacrifice and not refuse any house twice. be fun.
Horse
- 实现数据结构中的深度遍历算法,自动将国际象棋中的马在棋盘中遍历一遍并能够回到起点,不会走重复的路程-Depth data structure traversal algorithm to automatically chess chessboard horse traversal back to the beginning again and can not walk away from repeating
Horse-Stepping
- 马踏棋盘程序，在8*8的格子中，马（按中国象棋的走法）不重复的将64个点走遍！-Horse Stepping on board procedures, 8* 8 grid, Ma (Chinese chess moves) repeat 64 points all over!
Horse-traversal-issue
- 马步遍历问题 问题描述：有一n×m格的棋盘，按照国际象棋的规划，马只能走“日”字型结构，设计一算法，按马的走法将棋盘每一格刚好遍历一次。-Horse traversal issue Problem Descr iption: There is an n × m grid of the board, in accordance with the plan of chess, the horse can only take the day shaped structure, design
Chess
- 实现了马可以走动吃点兵的功能和棋盘的分布(The horse can walk to eat the distribution function and the board.)
jump
- 有一m*n的棋盘(即棋盘由m行和n列)，一马放在棋盘中任意位置，马按中国象棋跳法，从初始位置起跳，跳至边界后返回，求所有能返回初始位置的周游路线。(A m*n board (the board consists of M rows and N columns), a horse placed anywhere in the board, according to the China chess horse jump method, from the initial position jump,